Grokking Microsoft Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Microsoft Easy Problems
Buddy Strings (easy)
Solution: Buddy Strings
Can Place Flowers (easy)
Solution: Can Place Flowers
Reverse a LinkedList (easy)
Solution: Reverse a LinkedList
Maximum Number of Balloons (easy)
Solution: Maximum Number of Balloons
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Pair with Target Sum (easy)
Solution: Pair with Target Sum
Buy Two Chocolates (easy)
Solution: Buy Two Chocolates
Root Equals Sum of Children (easy)
Solution: Root Equals Sum of Children
Excel Sheet Column Title (easy)
Solution: Excel Sheet Column Title
Merge Strings Alternately (easy)
Solution: Merge Strings Alternately
Min Cost Climbing Stairs (easy)
Solution: Min Cost Climbing Stairs
Plus One (easy)
Solution: Plus One
Intersection of Two Arrays (easy)
Solution: Intersection of Two Arrays
Find the Index of the First Occurrence in a String (easy)
Solution: Find the Index of the First Occurrence in a String
Merge Two Sorted Lists (easy)
Solution: Merge Two Sorted Lists
Microsoft Medium Problems
Nth Digit (medium)
Solution: Nth Digit
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Find Original Array From Doubled Array (medium)
Solution: Find Original Array From Doubled Array
Reverse Words in a String II (medium)
Solution: Reverse Words in a String II
Longest Arithmetic Subsequence (medium)
Solution: Longest Arithmetic Subsequence
Matchsticks to Square (medium)
Solution: Matchsticks to Square
Score of Parentheses (medium)
Solution: Score of Parentheses
Maximum Length of a Concatenated String with Unique Characters (medium)
Solution: Maximum Length of a Concatenated String with Unique Characters
Inorder Successor in BST (medium)
Solution: Inorder Successor in BST
Distribute Coins in Binary Tree (medium)
Solution: Distribute Coins in Binary Tree
Spiral Matrix (medium)
Solution: Spiral Matrix
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Sum of Subarray Minimums (medium)
Solution: Sum of Subarray Minimums
Rotate Image (medium)
Solution: Rotate Image
Combinations (medium)
Solution: Combinations
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Multiply Strings (medium)
Solution: Multiply Strings
Best Time to Buy and Sell Stock II (medium)
Solution: Best Time to Buy and Sell Stock II
Largest Palindromic Number (medium)
Solution: Largest Palindromic Number
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Next Permutation (medium)
Solution: Next Permutation
132 Pattern (medium)
Solution: 132 Pattern
Valid Sudoku (medium)
Solution: Valid Sudoku
Number of Islands (medium)
Solution: Number of Islands
Buildings With an Ocean View (medium)
Solution: Buildings With an Ocean View
Microsoft Hard Problems
Regular Expression Matching (hard)
Solution: Regular Expression Matching
First Missing Positive (hard)
Solution: First Missing Positive
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Sliding Window Maximum (hard)
Solution: Sliding Window Maximum
Count Unique Characters of All Substrings of a Given String (hard)
Solution: Count Unique Characters of All Substrings of a Given String
Word Ladder (hard)
Solution: Word Ladder
Word Ladder II (hard)
Solution: Word Ladder II
Number of Flowers in Full Bloom (hard)
Solution: Number of Flowers in Full Bloom
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Solution: Median of Two Sorted Arrays

Problem Statement

Given two sorted arrays, nums1 and nums2 of different sizes in the ascending order, return the median of two sorted arrays after merging them.

The median is the middle value in an ordered set, or the average of the two middle values if the set has an even number of elements.

Examples

  1. Example 1:

    • Input: [1, 3, 5] and [2, 4, 6]
    • Expected Output: 3.5
    • Justification: When merged, the array becomes [1, 2, 3, 4, 5, 6]. The median is the average of the middle two values, (3 + 4) / 2 = 3.5.
  2. Example 2:

    • Input: [1, 1, 1] and [2, 2, 2]
    • Expected Output: 1.5
    • Justification: The merged array is [1, 1, 1, 2, 2, 2]. The median is (1 + 2) / 2 = 1.5.
  3. Example 3:

    • Input: [2, 3, 5, 8] and [1, 4, 6, 7, 9]
    • Expected Output: 5
    • Justification: The merged array would be [1, 2, 3, 4, 5, 6, 7, 8, 9]. The median is 5.

Constraints:

  • nums1.length == m
  • nums2.length == n
  • 0 <= m <= 1000
  • 0 <= n <= 1000
  • 1 <= m + n <= 2000
  • -106 <= nums1[i], nums2[i] <= 106

Solution

To find the median of two sorted arrays, we can use the merge step of the merge sort algorithm and the two-pinter approach. This approach involves merging the elements of both arrays into a single sorted sequence. However, unlike traditional merge sort, we don't need to merge the entire arrays. Instead, we only merge until we reach the median position.

The median position is determined by the combined size of the arrays, varying if the total number of elements is odd or even. The process involves comparing the elements at the pointer positions and advancing the pointer at the smaller element, thus mimicking a partial merge.

This step continues until the pointers reach the median position. The median is then calculated based on the last elements encountered by the pointers: directly for an odd total and as an average of the last two elements for an even total.

Step by Step Algorithm

  1. Initialize Pointers: Start with two pointers, one for each array, both initialized to point to the first element of their respective arrays.

  2. Determine Median Position: Calculate the position of the median in the merged array. If the total number of elements (N) in both arrays is odd, the median is at position (N + 1) / 2. If N is even, the median will be the average of the elements at positions N / 2 and (N / 2) + 1.

  3. Simulate Merging: Begin advancing the pointers through the arrays. At each step, compare the elements at the pointer positions in both arrays. Advance the pointer that points to the smaller element. This step mimics the merge process, but only the elements up to the median position are considered.

  4. Track Median Elements: Keep track of the last two elements encountered by the pointers. These are necessary for calculating the median, especially in the case of an even total number of elements.

  5. Determine Median Value: Once the pointers reach the median position(s):

    • For an odd total number of elements, the median is the last element moved.
    • For an even total number of elements, the median is the average of the last two elements moved.

Algorithm Walkthrough

Let's illustrate the algorithm with an example. Consider two arrays [2, 3, 5, 8] and [1, 4, 6, 7, 9].

  1. Initialize Pointers: pointer1 = 0 (for the first array), pointer2 = 0 (for the second array).
  2. Median Position: Total elements = 9, which is odd. Median position = (9 + 1) / 2 = 5.
  3. Simulate Merging:
    • Compare 2 and 1, move pointer2. New pointers: pointer1 = 0, pointer2 = 1.
    • Compare 2 and 4, move pointer1. New pointers: pointer1 = 1, pointer2 = 1.
    • Compare 3 and 4, move pointer1. New pointers: pointer1 = 2, pointer2 = 1.
    • Compare 5 and 4, move pointer2. New pointers: pointer1 = 2, pointer2 = 2.
    • Compare 5 and 6, move pointer1. New pointers: pointer1 = 3, pointer2 = 2.
  4. Track Median Elements: The fifth element (median position) is 5.
  5. Determine Median Value: Since the total number is odd, the median is 5.

Code

Here is the code for this algorithm:

Java
Saved to Cloud

. . . .

Time Complexity and Space Complexity Analysis

Time complexity

The time complexity of the provided code is O(n + m), where ( n ) and ( m ) are the lengths of the two input arrays nums1 and nums2. This is because the main loop in the function iterates approximately O((n + m)/2) times in the worst case, which simplifies to (O(n + m)) in Big O notation.

Space Complexity

The space complexity of the code is O(1) as the algorithm only uses a fixed number of extra variables (pointers and variables to track current and last values) regardless of the input size.

Median of Two Sorted Arrays (hard)
Longest Valid Parentheses (hard)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step by Step Algorithm

Algorithm Walkthrough

Code

Time Complexity and Space Complexity Analysis

Time complexity

Space Complexity